#include "common.h"

class Solution
{
public:
    vector<int> searchRange(vector<int> &nums, int target)
    {
        vector<int> result = {-1, -1};
        if(nums.size() == 0) return result;
        int left = 0, right = nums.size() -1;
        int begin = 0;
        while(left < right)
        {
            int mid = left + (right - left) / 2;
            if(nums[mid] < target) left = mid + 1;
            else right = mid;
        }

        if(nums[left] != target) return result;
        begin = left;
        int end = 0;
        right = nums.size() - 1;
        while(left < right)
        {
            int mid = left + (right - left + 1) / 2;
            if(nums[mid] <= target) left = mid;
            else right = mid - 1;
        }
        end = right;
        return {begin, end};
    }
};